Incomparability Results for Classes of Polynomial Tree Series Transformations
نویسندگان
چکیده
We consider (subclasses of) polynomial bottom-up and top-down tree series transducers over a partially ordered semiring A = (A,⊕, ,0,1, ), and we compare the classes of tree-to-tree-series and o-tree-to-tree-series transformations computed by such transducers. Our main result states the following. If, for some a ∈ A with 1 a, the semiring A is a weak a-growth semiring and either (i) the semiring A is additively idempotent and x, y ∈ {polynomial, deterministic, total, deterministic and total, homomorphism}, or (ii) 1 ≺ 1⊕ 1 and x, y ∈ {deterministic, deterministic and total, homomorphism}, then the statements x BOT(A) on y BOT(A) and x BOT(A) on y TOP(A) hold. Therein x BOT(A) for mod ∈ {ε, o} denotes the class of mod-tree-to-tree-series transformations computed by bottom-up tree series transducers, which have property x, over the semiring A (the class y TOP(A) is de ned similarly for top-down tree series transducers). Besides, on denotes incomparability with respect to set inclusion.
منابع مشابه
HASSE diagrams for classes of deterministic bottom-up tree-to-tree-series transformations
The relationship between classes of tree-to-tree-series and o-tree-to-tree-series transformations, which are computed by restricted deterministic bottom-up weighted tree transducers, is investigated. Essentially, these transducers are deterministic bottom-up tree series transducers, except that the former are defined over monoids whereas the latter are defined over semirings and only use the mu...
متن کاملInclusion Diagrams for Classes of Deterministic Bottom-up Tree-to-Tree-Series Transformations
In this paper we investigate the relationship between classes of tree-to-tree-series (for short: t-ts) and o-tree-to-tree-series (for short: o-t-ts) transformations computed by restricted deterministic bottom-up weighted tree transducers (for short: deterministic bu-w-tt). Essentially, deterministic bu-w-tt are deterministic bottom-up tree series transducers [EFV02, FV03, ful, FGV04], but the f...
متن کاملThe Power of Tree Series Transducers of Type I and II
The power of tree series transducers of type I and II is studied for IO as well as OI tree series substitution. More precisely, it is shown that the IO tree series transformations of type I (respectively, type II) are characterized by the composition of homomorphism top-down IO tree series transformations with bottom-up (respectively, linear bottom-up) IO tree series transformations. On the oth...
متن کاملHierarchies of Tree Series Transformations Revisited
Tree series transformations computed by polynomial topdown and bottom-up tree series transducers are considered. The hierarchy of tree series transformations obtained in [Fülöp, Gazdag, Vogler: Hierarchies of Tree Series Transformations. Theoret. Comput. Sci. 314(3), p. 387–429, 2004] for commutative izz-semirings (izz abbreviates idempotent, zero-sum and zero-divisor free) is generalized to ar...
متن کاملNilpotent Elements in Skew Polynomial Rings
Letbe a ring with an endomorphism and an -derivationAntoine studied the structure of the set of nilpotent elements in Armendariz rings and introduced nil-Armendariz rings. In this paper we introduce and investigate the notion of nil--compatible rings. The class of nil--compatible rings are extended through various ring extensions and many classes of nil--compatible rings are constructed. We al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Automata, Languages and Combinatorics
دوره 10 شماره
صفحات -
تاریخ انتشار 2005